Search for: All records

The discontinuous Petrov–Galerkin (DPG) method is a Petrov–Galerkin finite element method with test functions designed for obtaining stability. These test functions are computable locally, element by element, and are motivated by optimal test functions which attain the supremum in an inf-sup condition. A profound consequence of the use of nearly optimal test functions is that the DPG method can inherit the stability of the (undiscretized) variational formulation, be it coercive or not. This paper combines a presentation of the fundamentals of the DPG ideas with a review of the ongoing research on theory and applications of the DPG methodology. The scope of the presented theory is restricted to linear problems on Hilbert spaces, but pointers to extensions are provided. Multiple viewpoints to the basic theory are provided. They show that the DPG method is equivalent to a method which minimizes a residual in a dual norm, as well as to a mixed method where one solution component is an approximate error representation function. Being a residual minimization method, the DPG method yields Hermitian positive definite stiffness matrix systems even for non-self-adjoint boundary value problems. Having a built-in error representation, the method has the out-of-the-box feature that it can immediately be used in automatic adaptive algorithms. Contrary to standard Galerkin methods, which are uninformed about test and trial norms, the DPG method must be equipped with a concrete test norm which enters the computations. Of particular interest are variational formulations in which one can tailor the norm to obtain robust stability. Key techniques to rigorously prove convergence of DPG schemes, including construction of Fortin operators, which in the DPG case can be done element by element, are discussed in detail. Pointers to open frontiers are presented. 

Open systems with balanced gain and loss, described by parity-time reversal (PT) symmetric Hamiltonians have been deeply explored over the past decade. Most explorations are limited to finite discrete models (in real or reciprocal spaces) or continuum problems in one dimension. As a result, these models do not leverage the complexity and variability of two-dimensional continuum problems on a compact support. Here, we investigate eigenvalues of the Schrödinger equation on a disk with zero boundary condition, in the presence of constant, PT-symmetric, gain-loss potential that is confined to two mirror-symmetric disks. We find a rich variety of exceptional points, re-entrant PT-symmetric phases, and a nonmonotonic dependence of the PT-symmetry breaking threshold on the system parameters. By comparing results of two model variations, we show that this simple model of a multicore fiber supports propagating modes in the presence of gain and loss. 

We construct conforming finite element elasticity complexes on Worsey–Farin splits in three dimensions. Spaces for displacement, strain, stress, and the load are connected in the elasticity complex through the differential operators representing deformation, incompatibility, and divergence. For each of these component spaces, a corresponding finite element space on Worsey–Farin meshes is exhibited. Unisolvent degrees of freedom are developed for these finite elements, which also yields commuting (cochain) projections on smooth functions. A distinctive feature of the spaces in these complexes is the lack of extrinsic supersmoothness at subsimplices of the mesh. Notably, the complex yields the first (strongly) symmetric stress finite element with no vertex or edge degrees of freedom in three dimensions. Moreover, the lowest order stress space uses only piecewise linear functions which is the lowest feasible polynomial degree for the stress space. 

Structure-aware Taylor (SAT) methods are a class of timestepping schemes designed for propagating linear hyperbolic solutions within a tent-shaped spacetime region. Tents are useful to design explicit time marching schemes on unstructured advancing fronts with built-in locally variable timestepping for arbitrary spatial and temporal discretization orders. The main result of this paper is that an s s -stage SAT timestepping within a tent is weakly stable under the time step constraint Δ t ≤ C h 1 + 1 / s \Delta t \leq Ch^{1+1/s} , where Δ t \Delta t is the time step size and h h is the spatial mesh size. Improved stability properties are also presented for high-order SAT time discretizations coupled with low-order spatial polynomials. A numerical verification of the sharpness of proven estimates is also included. 

A prime objective of modeling optical fibers is capturing mode confinement losses correctly. This paper demonstrates that specific modeling choices, especially regarding the outer fiber cladding regions and the placement of the computational boundary, have significant impacts on the calculated mode losses. This sensitivity of the computed mode losses is especially high for microstructure fibers that do not guide light by total internal reflection. Our results illustrate that one can obtain disparate mode confinement loss profiles for the same optical fiber design simply by moving the boundary to a new material region. We conclude with new recommendations for how to better model these losses.